Cellular automata using infinite computations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cellular Automata Using Infinite Computations

This paper presents an application of the Infinite Unit Axiom, introduced by Yaroslav Sergeyev, (see [11] [14]) to the development of one-dimensional cellular automata. This application allows the establishment of a new and more precise metric on the space of definition for one-dimensional cellular automata, whereby accuracy of computations is increased. Using this new metric, open disks are de...

متن کامل

A classification of one-dimensional cellular automata using infinite computations

This paper proposes an application of the Infinite Unit Axiom and grossone, introduced by Yaroslav Sergeyev (see [15] [19]), to classify one-dimensional cellular automata whereby each class corresponds to a different and distinct dynamical behavior. The forward dynamics of a cellular automaton map are studied via defined classes. Using these classes, along with the Infinite Unit Axiom and gross...

متن کامل

Finite and Infinite Computations and a Classification of Two-Dimensional Cellular Automata Using Infinite Computations

This paper proposes an application of the Infinite Unit Axiom and grossone, introduced by Yaroslav Sergeyev (see [17] [21]), to the development and classification of two-dimensional cellular automata. This application establishes, by the application of grossone, a new and more precise nonarchimedean metric on the space of definition for two-dimensional cellular automata, whereby the accuracy of...

متن کامل

Two Cellular Automata for Plasma Computations

Plasma ap plicati ons of comput ational techniques based on cellular auto mat a are inhibited by the long-ran ge nature of electromagnetic forc es . On e of the most promis ing features of cellu lar automata methods has been th e parallelism that becomes possible because of the local natu re of th e interactions , leading (for example) to t he absence of Poisson equat ions to be solved in fluid...

متن کامل

Cellular automata computations and secret key cryptography

Franciszek Seredynski *, Pascal Bouvry , Albert Y. Zomaya d a Polish–Japanese Institute of Information Technologies, Koszykowa 86, 02-008 Warsaw, Poland b Institute of Computer Science of Polish Academy of Sciences, Ordona 21, 01-237 Warsaw, Poland c Faculty of Sciences, Technology and Communication, Luxembourg University 6, rue Coudenhove Kalergi, L-1359 Luxembourg-Kirchberg, Luxembourg d Scho...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Computation

سال: 2012

ISSN: 0096-3003

DOI: 10.1016/j.amc.2011.10.065